package com.gozap.sort.tree;

public class TreeMain {

//	static int[] arr = new int[] { 9, 4, 12, 10, 6, 29, 34, 98, 82, 14, 15 };

	public static void main(String[] args) {
		TreeOperation n = new TreeOperation();

		Tree t = n.buildTree();

		System.out.println(t);

		Tree search = n.search(t, 12);
		System.out.println("search:" + search);

		Tree m = n.max(search);
		System.out.println("max:" + m);

		m = n.min(search);
		System.out.println("min:" + m);

		m = n.before(search);
		System.out.println("before:" + m);

		m = n.after(search);
		System.out.println("after:" + m);

		m = n.remove(search);
		System.out.println("remove:" + m);

	}
}
